package com.wyh.day05.exercises;

/**
 * @author 王艺豪
 * @version 1.0
 */
public class Exercise02 {
    public static void main(String[] args) {

        //冒泡排序
        int[] arr = {2, 35, 363, 2, 1, 41, 432};
        int temp = 0;
        System.out.println("冒泡排序");
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
            System.out.println("第" + (i + 1) + "次排序");
            for (int j = 0; j < arr.length; j++) {
                System.out.print(arr[j] + " ");
            }
            System.out.println();
        }
        System.out.println("排序后的效果");
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }



    }
}
